Connected hypergraphs with small spectral radius
نویسندگان
چکیده
منابع مشابه
On spectral radius of strongly connected digraphs
It is known that the directed cycle of order $n$ uniquely achieves the minimum spectral radius among all strongly connected digraphs of order $nge 3$. In this paper, among others, we determine the digraphs which achieve the second, the third and the fourth minimum spectral radii respectively among strongly connected digraphs of order $nge 4$.
متن کاملon spectral radius of strongly connected digraphs
it is known that the directed cycle of order $n$ uniquely achieves the minimum spectral radius among all strongly connected digraphs of order $nge 3$. in this paper, among others, we determine the digraphs which achieve the second, the third and the fourth minimum spectral radii respectively among strongly connected digraphs of order $nge 4$.
متن کاملSpectral radius and signless Laplacian spectral radius of strongly connected digraphs
Article history: Received 15 April 2014 Accepted 5 May 2014 Available online 29 May 2014 Submitted by R. Brualdi MSC: 05C20 05C50 15A18
متن کاملSpectral Radius and Traceability of Connected Claw-Free Graphs
Let G be a connected claw-free graph on n vertices and G be its complement. Let μ(G) be the spectral radius of G. Denote by Nn−3,3 the graph consisting of Kn−3 and three disjoint pendent edges. In this note we prove that: (1) If μ(G) ≥ n − 4, then G is traceable unless G = Nn−3,3. (2) If μ(G) ≤ μ(Nn−3,3) and n ≥ 24, then G is traceable unless G = Nn−3,3. Our works are counterparts on claw-free ...
متن کاملSpectral radius and maximum degree of connected graphs
Given a connected irregular graph G of order n, write μ for the largest eigenvalue of its adjacency matrix, ∆ for its maximum degree, andD for its diameter. We prove that ∆− μ > 1 (D + 2)n and this bound is tight up to a constant factor. This improves previous results of Stevanović and Zhang, and extends a result of Alon and Sudakov.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2016
ISSN: 0024-3795
DOI: 10.1016/j.laa.2016.07.013